Optimal testing and repairing a failed series system
Identifieur interne : 005415 ( Main/Exploration ); précédent : 005414; suivant : 005416Optimal testing and repairing a failed series system
Auteurs : Mikhail Y. Kovalyov [Biélorussie] ; Marie-Claude Portmann [France] ; Ammar Oulamara [France]Source :
- Journal of Combinatorial Optimization [ 1382-6905 ] ; 2006-11-01.
Descripteurs français
- Pascal (Inist)
English descriptors
- KwdEn :
- Boolean function, Combinatorial optimization, Failure detection, Failure diagnosis, Failures, Fully polynomial time approximation scheme, Optimization, Polynomial approximation, Polynomial time, Pseudo-boolean functions, Quadratic function, Repair, Repairable system, Repairing, Series system, Test and repair policies.
Abstract
Abstract: We consider a series repairable system that includes n components and assume that it has just failed because exactly one of its components has failed. The failed component is unknown. Probability of each component to be responsible for the failure is given. Each component can be tested and repaired at given costs. Both testing and repairing operations are assumed to be perfect, that is, the result of testing a component is a true information that this component is failed or active (not failed), and the result of repairing is that the component becomes active. The problem is to find a sequence of testing and repairing operations over the components such that the system is always repaired and the total expected cost of testing and repairing the components is minimized. We show that this problem is equivalent to minimizing a quadratic pseudo-boolean function. Polynomially solvable special cases of the latter problem are identified and a fully polynomial time approximation scheme (FPTAS) is derived for the general case. Computer experiments are provided to demonstrate high efficiency of the proposed FPTAS. In particular, it is able to find a solution with relative error ɛ = 0.1 for problems with more than 4000 components within 5 minutes on a standard PC with 1.2 Mhz processor.
Url:
DOI: 10.1007/s10878-006-9633-0
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 000452
- to stream Istex, to step Curation: 000449
- to stream Istex, to step Checkpoint: 001268
- to stream Main, to step Merge: 005561
- to stream PascalFrancis, to step Corpus: 000419
- to stream PascalFrancis, to step Curation: 000614
- to stream PascalFrancis, to step Checkpoint: 000361
- to stream Main, to step Merge: 005766
- to stream Main, to step Curation: 005415
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Optimal testing and repairing a failed series system</title><author><name sortKey="Kovalyov, Mikhail Y" sort="Kovalyov, Mikhail Y" uniqKey="Kovalyov M" first="Mikhail Y." last="Kovalyov">Mikhail Y. Kovalyov</name></author><author><name sortKey="Portmann, Marie Claude" sort="Portmann, Marie Claude" uniqKey="Portmann M" first="Marie-Claude" last="Portmann">Marie-Claude Portmann</name></author><author><name sortKey="Oulamara, Ammar" sort="Oulamara, Ammar" uniqKey="Oulamara A" first="Ammar" last="Oulamara">Ammar Oulamara</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:14781783EC2EC443421301BA6C59E9CEA7A41881</idno><date when="2006" year="2006">2006</date><idno type="doi">10.1007/s10878-006-9633-0</idno><idno type="url">https://api.istex.fr/ark:/67375/VQC-FNN25446-X/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">000452</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">000452</idno><idno type="wicri:Area/Istex/Curation">000449</idno><idno type="wicri:Area/Istex/Checkpoint">001268</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">001268</idno><idno type="wicri:doubleKey">1382-6905:2006:Kovalyov M:optimal:testing:and</idno><idno type="wicri:Area/Main/Merge">005561</idno><idno type="wicri:source">INIST</idno><idno type="RBID">Pascal:06-0493027</idno><idno type="wicri:Area/PascalFrancis/Corpus">000419</idno><idno type="wicri:Area/PascalFrancis/Curation">000614</idno><idno type="wicri:Area/PascalFrancis/Checkpoint">000361</idno><idno type="wicri:explorRef" wicri:stream="PascalFrancis" wicri:step="Checkpoint">000361</idno><idno type="wicri:doubleKey">1382-6905:2006:Kovalyov M:optimal:testing:and</idno><idno type="wicri:Area/Main/Merge">005766</idno><idno type="wicri:Area/Main/Curation">005415</idno><idno type="wicri:Area/Main/Exploration">005415</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Optimal testing and repairing a failed series system</title><author><name sortKey="Kovalyov, Mikhail Y" sort="Kovalyov, Mikhail Y" uniqKey="Kovalyov M" first="Mikhail Y." last="Kovalyov">Mikhail Y. Kovalyov</name><affiliation wicri:level="1"><country xml:lang="fr">Biélorussie</country><wicri:regionArea>Faculty of Economics, Belarusian State University, Skorini 4, 220050, Minsk</wicri:regionArea><wicri:noRegion>Minsk</wicri:noRegion></affiliation><affiliation wicri:level="1"><country xml:lang="fr">Biélorussie</country><wicri:regionArea>United Institute of Informatics Problems, National Academy of Sciences of Belarus, Skorini 4, 220050, Minsk</wicri:regionArea><wicri:noRegion>Minsk</wicri:noRegion></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Biélorussie</country></affiliation></author><author><name sortKey="Portmann, Marie Claude" sort="Portmann, Marie Claude" uniqKey="Portmann M" first="Marie-Claude" last="Portmann">Marie-Claude Portmann</name><affiliation wicri:level="3"><country xml:lang="fr">France</country><wicri:regionArea>MACSI Project LORIA-INRIA, Ecole des Mines de Nancy, Parc de Saurupt, 540042, Nancy</wicri:regionArea><placeName><region type="region" nuts="2">Grand Est</region><region type="old region" nuts="2">Lorraine (région)</region><settlement type="city">Nancy</settlement></placeName></affiliation><affiliation wicri:level="1"><country wicri:rule="url">France</country></affiliation></author><author><name sortKey="Oulamara, Ammar" sort="Oulamara, Ammar" uniqKey="Oulamara A" first="Ammar" last="Oulamara">Ammar Oulamara</name><affiliation wicri:level="3"><country xml:lang="fr">France</country><wicri:regionArea>MACSI Project LORIA-INRIA, Ecole des Mines de Nancy, Parc de Saurupt, 540042, Nancy</wicri:regionArea><placeName><region type="region" nuts="2">Grand Est</region><region type="old region" nuts="2">Lorraine (région)</region><settlement type="city">Nancy</settlement></placeName></affiliation><affiliation wicri:level="1"><country wicri:rule="url">France</country></affiliation></author></analytic><monogr></monogr><series><title level="j">Journal of Combinatorial Optimization</title><title level="j" type="abbrev">J Comb Optim</title><idno type="ISSN">1382-6905</idno><idno type="eISSN">1573-2886</idno><imprint><publisher>Kluwer Academic Publishers</publisher><pubPlace>Boston</pubPlace><date type="published" when="2006-11-01">2006-11-01</date><biblScope unit="volume">12</biblScope><biblScope unit="issue">3</biblScope><biblScope unit="page" from="279">279</biblScope><biblScope unit="page" to="295">295</biblScope></imprint><idno type="ISSN">1382-6905</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">1382-6905</idno></seriesStmt></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Boolean function</term><term>Combinatorial optimization</term><term>Failure detection</term><term>Failure diagnosis</term><term>Failures</term><term>Fully polynomial time approximation scheme</term><term>Optimization</term><term>Polynomial approximation</term><term>Polynomial time</term><term>Pseudo-boolean functions</term><term>Quadratic function</term><term>Repair</term><term>Repairable system</term><term>Repairing</term><term>Series system</term><term>Test and repair policies</term></keywords><keywords scheme="Pascal" xml:lang="fr"><term>Approximation polynomiale</term><term>Défaillance</term><term>Dépannage</term><term>Détection panne</term><term>Fonction booléenne</term><term>Fonction quadratique</term><term>Optimisation combinatoire</term><term>Réparation</term><term>Système réparable</term><term>Système série</term><term>Temps polynomial</term></keywords></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: We consider a series repairable system that includes n components and assume that it has just failed because exactly one of its components has failed. The failed component is unknown. Probability of each component to be responsible for the failure is given. Each component can be tested and repaired at given costs. Both testing and repairing operations are assumed to be perfect, that is, the result of testing a component is a true information that this component is failed or active (not failed), and the result of repairing is that the component becomes active. The problem is to find a sequence of testing and repairing operations over the components such that the system is always repaired and the total expected cost of testing and repairing the components is minimized. We show that this problem is equivalent to minimizing a quadratic pseudo-boolean function. Polynomially solvable special cases of the latter problem are identified and a fully polynomial time approximation scheme (FPTAS) is derived for the general case. Computer experiments are provided to demonstrate high efficiency of the proposed FPTAS. In particular, it is able to find a solution with relative error ɛ = 0.1 for problems with more than 4000 components within 5 minutes on a standard PC with 1.2 Mhz processor.</div></front></TEI><affiliations><list><country><li>Biélorussie</li><li>France</li></country><region><li>Grand Est</li><li>Lorraine (région)</li></region><settlement><li>Nancy</li></settlement></list><tree><country name="Biélorussie"><noRegion><name sortKey="Kovalyov, Mikhail Y" sort="Kovalyov, Mikhail Y" uniqKey="Kovalyov M" first="Mikhail Y." last="Kovalyov">Mikhail Y. Kovalyov</name></noRegion><name sortKey="Kovalyov, Mikhail Y" sort="Kovalyov, Mikhail Y" uniqKey="Kovalyov M" first="Mikhail Y." last="Kovalyov">Mikhail Y. Kovalyov</name><name sortKey="Kovalyov, Mikhail Y" sort="Kovalyov, Mikhail Y" uniqKey="Kovalyov M" first="Mikhail Y." last="Kovalyov">Mikhail Y. Kovalyov</name></country><country name="France"><region name="Grand Est"><name sortKey="Portmann, Marie Claude" sort="Portmann, Marie Claude" uniqKey="Portmann M" first="Marie-Claude" last="Portmann">Marie-Claude Portmann</name></region><name sortKey="Oulamara, Ammar" sort="Oulamara, Ammar" uniqKey="Oulamara A" first="Ammar" last="Oulamara">Ammar Oulamara</name><name sortKey="Oulamara, Ammar" sort="Oulamara, Ammar" uniqKey="Oulamara A" first="Ammar" last="Oulamara">Ammar Oulamara</name><name sortKey="Portmann, Marie Claude" sort="Portmann, Marie Claude" uniqKey="Portmann M" first="Marie-Claude" last="Portmann">Marie-Claude Portmann</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 005415 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 005415 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:14781783EC2EC443421301BA6C59E9CEA7A41881
|texte= Optimal testing and repairing a failed series system
}}
| This area was generated with Dilib version V0.6.33. |  |